Longest alternating subsequences in pattern-restricted k-ary words

نویسنده

  • Toufik Mansour
چکیده

We study the generating functions for pattern-restricted k-ary words of length n corresponding to the longest alternating subsequence statistic in which the pattern is any one of the six permutations of length three.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Longest alternating subsequences of k-ary words

Recently, Stanley [Longest alternating subsequences of permutations, preprint, arXiv/0511419v1] studied the length of the longest alternating subsequence of a permutation in the symmetric group,where a sequencea, b, c, d, . . . isalternating ifa >bd < · · ·. In this paper, we extend this result to the case of k-ary words. More precisely, we find an explicit formula for the generating functio...

متن کامل

Longest Alternating Subsequences in Pattern-Restricted Permutations

Inspired by the results of Stanley and Widom concerning the limiting distribution of the lengths of longest alternating subsequences in random permutations, and results of Deutsch, Hildebrand and Wilf on the limiting distribution of the longest increasing subsequence for pattern-restricted permutations, we find the limiting distribution of the longest alternating subsequence for pattern-restric...

متن کامل

Longest Monotone Subsequences and Rare Regions of Pattern-Avoiding Permutations

We consider the distributions of the lengths of the longest monotone and alternating subsequences in classes of permutations of size n that avoid a specific pattern or set of patterns, with respect to the uniform distribution on each such class. We obtain exact results for any class that avoids two patterns of length 3, as well as results for some classes that avoid one pattern of length 4 or m...

متن کامل

2 00 3 Longest increasing subsequences in pattern - restricted permutations

Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limiting distributions for pattern-restricted permutations in which the pattern is any one of the six patterns of length 3. We show that the (132)-avoiding case is identical to the distribution of heights of ordered trees, ...

متن کامل

3 Longest increasing subsequences in pattern - restricted permutations

Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limiting distributions for pattern-restricted permutations in which the pattern is any one of the six patterns of length 3. We show that the (132)-avoiding case is identical to the distribution of heights of ordered trees, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008